Strongly regular graphs constructed from p-ary bent functions
نویسندگان
چکیده
In this paper, we generalize the construction of strongly regular graphs in Tan et al. (J. Comb. Theory, Ser. A 117:668–682, 2010) from ternary bent functions to p-ary bent functions, where p is an odd prime. We obtain strongly regular graphs with three types of parameters. Using certain non-quadratic p-ary bent functions, our constructions can give rise to new strongly regular graphs for small parameters.
منابع مشابه
Linear codes with two or three weights from quadratic Bent functions
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of p-ary linear codes with two or three weights are constructed from quadratic Bent functions over the finite field Fp, where p is an odd prime. They include some earlier linear codes as special cases. The weight distributions...
متن کاملNew infinite families of p-ary weakly regular bent functions
The characterization and construction of bent functions are challenging problems. The paper generalizes the constructions of Boolean bent functions by Mesnager [33], Xu et al. [40] and p-ary bent functions by Xu et al. [41] to the construction of p-ary weakly regular bent functions and presents new infinite families of p-ary weakly regular bent functions from some known weakly regular bent func...
متن کاملPARTIAL DIFFERENCE SETS FROM p-ARY WEAKLY REGULAR BENT FUNCTIONS AND QUADRATIC FORMS
We generalize the construction of affine polar graphs in two different ways to obtain partial difference sets and amorphic association schemes. In the first generalization we replace the quadratic form in the affine polar graph construction by higher degree homogeneous functions that are p-ary weakly regular bent. The second generalization uses a combination of quadratic forms and uniform cyclo...
متن کاملPartial Difference Sets from Quadratic Forms and p-ary Weakly Regular Bent Functions
We generalize the construction of affine polar graphs in two different ways to obtain new partial difference sets and amorphic association schemes. The first generalization uses a combination of quadratic forms and uniform cyclotomy. In the second generalization we replace the quadratic form in the affine polar graph construction by higher degree homogeneous functions that are p-ary weakly regu...
متن کاملA new class of three-weight linear codes from weakly regular plateaued functions
Linear codes with few weights have many applications in secret sharing schemes, authentication codes, communication and strongly regular graphs. In this paper, we consider linear codes with three weights in arbitrary characteristic. To do this, we generalize the recent contribution of Mesnager given in [Cryptography and Communications 9(1), 71-84, 2017]. We first present a new class of binary l...
متن کامل